(FDTD) code using java mobile agents, and special agent communication and synchronization aspects related to FDTD

This paper develops a general, theoretical computational model for discussing synchronization and specification scheme. We analyze the domains of relationships between agents in a coordination system. A set of algorithms is proposed to derive reasonable relations between agents. Possible conflicts in the agent specification are firstly detected and eliminated. The mechanism constructs partial order relations among actions. We also propose a temporal algebra to deal with qualitative and quantitative temporal relationships and to reason about definite and indefinite time. The algebra can also integrate instant points and even intervals. Several computation tables are proposed, and each table include a set of complete logics. The mechanism is efficiently to eliminate conflict specification and to generate synchronization scenarios. The contributions of this paper are using the generic relationship framework to handle synchronization specifications, and to eliminate conflicts in order to satisfy agent request.